Strong convergence for generalized multiple-set split feasibility problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Explicit and Hybrid Strong Convergence Algorithms for Solving the Multiple-Sets Split Feasibility Problem

In this paper, we present several explicit and hybrid strong convergence algorithms for solving the multiple-sets split feasibility problem (MSSFP). Firstly, we modify the existing successive, parallel and cyclic algorithms with the hybrid steepest descent method; then two new hybrid formulas based on the Mann type method are presented; Two general hybrid algorithms which can cover the former o...

متن کامل

A general convergence theorem for multiple-set split feasibility problem in Hilbert spaces

We establish strong convergence result of split feasibility problem for a family of quasi-nonexpansive multi-valued mappings and a total asymptotically strict pseudo-contractive mapping in infinite dimensional Hilbert spaces. Acknowledgement. The authors A. R. Khan and M. Abbas are grateful to King Fahd University of Petroleum and Minerals for supporting research project IN 121037.

متن کامل

Strong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces

In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.

متن کامل

Approximating Curve and Strong Convergence of the CQ Algorithm for the Split Feasibility Problem

Using the idea of Tikhonov’s regularization, we present properties of the approximating curve for the split feasibility problem SFP and obtain the minimum-norm solution of SFP as the strong limit of the approximating curve. It is known that in the infinite-dimensional setting, Byrne’s CQ algorithm Byrne, 2002 has only weak convergence. We introduce a modification of Byrne’s CQ algorithm in such...

متن کامل

Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces

In this paper, we propose several new iterative algorithms to solve the split feasibility problem in the Hilbert spaces. By virtue of new analytical techniques, we prove that the iterative sequence generated by these iterative procedures converges to the solution of the split feasibility problem which is the best close to a given point. In particular, the minimum-norm solution can be found via ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Filomat

سال: 2016

ISSN: 0354-5180,2406-0933

DOI: 10.2298/fil1602459l